APC Semantics for Petri Nets

نویسندگان

  • Slavomír Simonák
  • Stefan Hudák
  • Stefan Korecko
چکیده

The paper deals with an algebraic semantics for Petri nets, based on a process algebra APC (Algebra of Process Components) by the authors. APC is tailored especially for describing processes in Petri nets. This is done by assigning special variables (called E-variables here) to every place of given Petri net, expressing processes initiated in those places. Algebraic semantics is then given as a parallel composition of all the variables, whose corresponding places hold token(s) within the initial marking. Resulting algebraic specification preserves operational behavior of the original net-based specification.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Embedding of Petri Nets into Event-B

We present an embedding of Petri nets into B abstract systems. The embedding is achieved by translating both the static structure (modelling aspect) and the evolution semantics of Petri nets. The static structure of a Petri net is captured within a B abstract system through a graph structure. This abstract system is then included in another abstract system which captures the evolution semantics...

متن کامل

Complete Process Semantics of Petri Nets

In the first part of this paper we extend the semantical framework proposed in [22] for process and causality semantics of Petri nets by an additional aim, firstly mentioned in the habilitation thesis [15]. The aim states that causality semantics deduced from process nets should be complete w.r.t. step semantics of a Petri net in the sense that each causality structure which is enabled w.r.t. s...

متن کامل

A Sheaf Semantics for Petri Nets a Sheaf Semantics for Petri Nets

The semantics of Petri Nets are discussed within the "Objects are sheaves" paradigm. Transitions and places are represented as sheaves and nets are represented as diagrams of sheaves. Both an interleaving semantics, and a non-interleaving semantics are shown to arise as the limit of the sheaf diagram representing the net.

متن کامل

Rewriting Logic as a Unifying Framework for Petri Nets

We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by individual tokens, test arcs, and time. Based on the idea that “Petri nets are monoids” suggested by Meseguer and Montanari we define a rewriting semantics that maps place/transition nets into rewriting logic specificat...

متن کامل

Petri Nets Semantics of P-calculus

As p-calculus based on the interleaving semantics cannot depict the true concurrency and has few supporting tools, it is translated into Petri nets. p-calculus is divided into basic elements, sequence, concurrency, choice and recursive modules. These modules are translated into Petri nets to construct a complicated system. Petri nets semantics for p-calculus visualize system structure as well a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Informatica (Slovenia)

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2008